Implications of Register and Memory Temporal Locality for Distributed Microarchitectures

نویسنده

  • D. Morano
چکیده

We explore various intervals between register assignments and the subsequent uses of the same registers. We also explore memory stores and the subsequent loads to the same memory addresses. Three di erent types of access intervals are de ned and data are gathered on them using benchmarks. This data serves to provide insight about how a distributed microarchitecture might take advantage of the register or memory access behavior in order to reduce the overhead of accessing centralized machine resources like a register le (in the case of register operations) or the memory hierarchy in the case of memory operations. A proposed distributed microarchitecture is brie y presented and data about its ability to allow operand bypassing of centralized machine resources to satisfy memory load requests is provided.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intra-level Incomplete Bypassing: Achieving Performance and Power Efficiency

Villasenor, Eric P. M.S.E.C.E., Purdue University, December, 2007. Intra-level Incomplete Bypassing: Achieving Performance and Power Efficiency . Major Professor: Mithuna S. Thottethodi. Researchers have proposed clustered microarchitectures to capture the benefits of high performance and high energy efficiency. Typically, clustered microarchitectures offer fast local bypasses (i.e., value forw...

متن کامل

Speculative prefetching of optional locks in distributed systems

We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applications. In the worst case, some of our methods will not produce higher network latencies than equivalent conventional distributed locking methods. In best case, the total number of messages can be constantly bounded, appro...

متن کامل

Cache Memories

The use of cache memories are so pervasive in today’s computer systems it is difficult to imagine processors without them. Cache memories, along with virtual memories and processor registers form a continuum of memory hierarchies that rely on the principle of locality of reference. Most applications exhibit temporal and spatial localities among instructions and data. Spatial locality implies th...

متن کامل

A New Format for the Sparse Matrix-vector Multiplication

Algorithms for the sparse matrix-vector multiplication (shortly SpMV) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the memory access patterns are irregular and the utilization of a cache suffers from low spatial and temporal locality. To reduce this effect, the register blocking formats were designed. This paper introduces a new combine...

متن کامل

An Evaluation of Thread Migration for Exploiting Distributed Array Locality

Thread migration is one approach to remote memory accesses on distributed memory parallel computers. In thread migration, threads of control migrate between processors to access data local to those processors, while conventional approaches tend to move data to the threads that need them. Migration approaches enhance spatial locality by making large address spaces local, but are less adept at ex...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002